Journal of Liaoning Petrochemical University
  Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
 
Probabilistic Computation Method for Some Types of Integral
YU Jing-xian, LI Jin-qiu, MIAO Chen
Abstract495)      PDF (936KB)(865)      
 
Considering the complexity and infeasibility of Newton-Leibniz formula in computing some types of integral, it was used the density functions and numerical characteristics of exponential distribution, normal distribution and chi-square distribution to compute three types of integral in calculus. Three computational formulas were got. Through the process of proof, it was found that the convenience of probabilistic method and close relationship between probability theory and calculus.
2012, 32 (4): 95-98. DOI: 10.3696/j.issn.1672-6952.2012.04.025
 
Talent Selection Model Based on Fuzzy AHP and Fuzzy TOPSIS
LI Jin-qiu, YU Jing-xian, MIAO Chen
Abstract345)      PDF (884KB)(260)      
 
Considering the fuzziness of indicator weight and indicator value, a talent selection scheme is created. We firstly build up judgment matrix and evaluation matrix based on linguistic variables. Secondly, the linguistic variables are translated to triangle fuzzy numbers and the fuzzy judgment matrix and fuzzy evaluation matrix are got. Thirdly, we get the fuzzy weights of indicators by fuzzy AHP, and get the closeness coefficient and ranking of each evaluated object by fuzzy TOPSIS. At last taking the selection of team member of MCM for example, we illustrate the feasibility and efficiency of the scheme.
2012, 32 (4): 88-91. DOI: 10.3696/j.issn.1672-6952.2012.04.023
α-Chain Diagonally Dominant Matrix and Criterion for Nonsingular H -Matrix
WANG Ming-gang, SONG Dai-cai, MIAO Chen
Abstract400)      PDF (166KB)(385)      
 
Let A=( a ij)∈C n ×n, if there exists α∈ (0,1) which can make|a ii|≥R α i(A)S 1- α i(A) be right for i∈N={1,2,…,n}, then A is called a chain diagonally dominant matrix. the concept was extended to generalized α-chain diagonally dominant matrix,and the concept generalized α-chain diagonally dominant matrix was applied to obtain some new criteria condition for a matrix to be a nonsingular H-matrix. The results obtained improve the known corresponding results.Finally, a numerical example was given for illustrating advantage of results.
2010, 30 (2): 74-77. DOI: 10.3696/j.issn.1672-6952.2010.02.021
A Hybrid Hook-Jeveese Search and Improved Particle Swarm Optimization Method
MIAO Chen, LIU Guo-zhi*
Abstract355)      PDF (160KB)(328)      
The hybrid algorithm based on the Hook-Jeeves search method and the local constriction approach particle swarm optimization (PSO) with linear varying inertia weight (HJ-LLPSO) for unconstrained optimization was put forward. HJ-LLPSO is very easy to implement in practice since it does not require gradient computation. The modification of the particle swarm optimization intends to produce faster and more accurate convergence. The main purpose is to demonstrate how the standard particle swarm optimizers can be improved by incorporating a hybrid strategy. In a suit of 6 test function problems taken from the literature, computational results via a comprehensive experimental study show that the hybrid HJ-LLPSO approach outperforms other two relevant search techniques (i.e., the original PSO and PSO combined with chaos) in terms of solution quality and convergence rate. As evidenced by the overall assessment based on computational experience, the new algorithm is extremely effective and efficient at locating best-practice optimal solutions for unconstrained optimization.
2009, 29 (1): 87-90.
Hybrid Powell Search and the Local Constriction Approach Particle Swarm Optimization With Linear Varying Inertia Weight for Unconstrained Optimization
LIU Guo-zhi, MIAO Chen
Abstract406)      PDF (203KB)(236)      
The hybrid Powell-LLPSO algorithm based on the Powell search method and the local constriction approach particle swarm optimization with linear varying inertia weight for unconstrained optimization was proposed. Powel-LLPSO is very easy to implement in practice since does not require gradient computation. The modification of both the Powell search method and particle swarm optimization intends to produce faster and more accurate convergence. The main purpose is to demonstrate how the standard particle swarm optimizers can be improved by incorporating a hybrid strategy. In a suit of 20 test function problems taken from the literature, computational results via a comprehensive experimental study, preceded by the investigation of parameter selection, show that the hybrid Powell-LLPSO approach outperforms other three relevant search techniques (the original PSO, the guaranteed convergence particle swarm optimization (GCPSO) and hybrid NM-PSO) in terms of solution quality and convergence rate. In a later part of the comparative experiment, the Powell-LLPSO algorithm was compared to various most up-to-date cooperative PSO (CPSO) procedures appearing in the literature. The comparison report still largely favors the Powell-LLPSO algorithm in the performance of accuracy, robustness and function evaluation.
2008, 28 (3): 70-74.